Sequentially Swapping Tokens: Further on Graph Classes
نویسندگان
چکیده
We study the following variant of 15 puzzle. Given a graph and two token placements on vertices, we want to find walk minimum length (if any exists) such that sequence swappings along obtains one given from other one. This problem was introduced as Sequential Token Swapping by Yamanaka et al. [JGAA 2019], who showed is intractable in general but polynomial-time solvable for trees, complete graphs, cycles. In this paper, present algorithm block-cactus which include all previously known cases. also tools showing hardness restricted classes chordal graphs bipartite graphs. show hard grids king’s are corresponding puzzle its with relaxed moves.
منابع مشابه
Swapping Labeled Tokens on Graphs
Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens on adjacent vertices. We prove that every such puzzle is solvable in O(n) token swaps, and thus focus on the problem of minimizing the number of token swaps to reach the target tok...
متن کاملSwapping Colored Tokens on Graphs
We investigate the computational complexity of the following problem. We are given a graph in which each vertex has an initial and a target color. Each pair of adjacent vertices can swap their current colors. Our goal is to perform the minimum number of swaps so that the current and target colors agree at each vertex. When the colors are chosen from {1, 2, . . . , c}, we call this problem c-Col...
متن کاملFurther Results on Sequentially Additive Graphs
Given a graph G with p vertices, q edges and a positive integer k, a k-sequentially additive labeling of G is an assignment of distinct numbers k, k + 1, k + 2, . . . , k + p + q − 1 to the p + q elements of G so that every edge uv of G receives the sum of the numbers assigned to the vertices u and v. A graph which admits such an assignment to its elements is called a k-sequentially additive gr...
متن کاملThe Bipartite Swapping Trick on Graph Homomorphisms
We provide an upper bound to the number of graph homomorphisms from G to H, where H is a fixed graph with certain properties, and G varies over all N -vertex, d-regular graphs. This result generalizes a recently resolved conjecture of Alon and Kahn on the number of independent sets. We build on the work of Galvin and Tetali, who studied the number of graph homomorphisms from G to H when G is bi...
متن کاملOn the Maximum Number of Dominating Classes in Graph Coloring
In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2023
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-031-23101-8_15